Termination w.r.t. Q of the following Term Rewriting System could be proven:

Q restricted rewrite system:
The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s, cons(Y)) → cons(Y)
from(X) → cons(X)
add(0, X) → X
add(s, Y) → s
len(nil) → 0
len(cons(X)) → s

Q is empty.


↳ QTRS
  ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s, cons(Y)) → cons(Y)
from(X) → cons(X)
add(0, X) → X
add(s, Y) → s
len(nil) → 0
len(cons(X)) → s

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

fst(0, Z) → nil
fst(s, cons(Y)) → cons(Y)
from(X) → cons(X)
add(0, X) → X
add(s, Y) → s
len(nil) → 0
len(cons(X)) → s

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

fst(0, Z) → nil
fst(s, cons(Y)) → cons(Y)
add(0, X) → X
add(s, Y) → s
len(nil) → 0
len(cons(X)) → s
Used ordering:
Polynomial interpretation [25]:

POL(0) = 2   
POL(add(x1, x2)) = 2 + 2·x1 + x2   
POL(cons(x1)) = 2 + x1   
POL(from(x1)) = 2 + 2·x1   
POL(fst(x1, x2)) = 1 + 2·x1 + 2·x2   
POL(len(x1)) = 2 + 2·x1   
POL(nil) = 1   
POL(s) = 1   




↳ QTRS
  ↳ RRRPoloQTRSProof
    ↳ QTRS
      ↳ RRRPoloQTRSProof

Q restricted rewrite system:
The TRS R consists of the following rules:

from(X) → cons(X)

Q is empty.

The following Q TRS is given: Q restricted rewrite system:
The TRS R consists of the following rules:

from(X) → cons(X)

Q is empty.
The following rules can be removed by the rule removal processor [15] because they are oriented strictly by a polynomial ordering:

from(X) → cons(X)
Used ordering:
Polynomial interpretation [25]:

POL(cons(x1)) = 1 + x1   
POL(from(x1)) = 2 + 2·x1   




↳ QTRS
  ↳ RRRPoloQTRSProof
    ↳ QTRS
      ↳ RRRPoloQTRSProof
        ↳ QTRS
          ↳ RisEmptyProof

Q restricted rewrite system:
R is empty.
Q is empty.

The TRS R is empty. Hence, termination is trivially proven.